Fast Partitioning l-apex graphs with Applications to Approximating Maximum Induced-Subgraph Problems
نویسندگان
چکیده
A graph is l-apex if it can be made planar by removing at most l vertices. In this paper we show that the vertex set of any graph not containing an l-apex graph as a minor can be quickly partitioned into 2 l sets inducing graphs with small treewidth. As a consequence, several maximum induced-subgraph problems when restricted to graph classes not containing some special l-apex graphs as minors, have practical approximation algorithms.
منابع مشابه
Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems
A graph is l-apex if it can be made planar by removing at most l vertices. In this paper we show that the vertex set of any graph not containing an lapex graph as a minor can be quickly partitioned into 2 sets inducing graphs with small treewidth. As a consequence, several maximum induced-subgraph problems when restricted to graph classes not containing some special l-apex graphs as minors, hav...
متن کاملApproximations via Partitioning
We consider the approximation of weighted maximum subgraph problems by partitioning the input graph into easier subproblems. In particular, we obtain efficient approximations of the weighted independent set problem with performance ratios of O(n(log log n/ log n)) and (∆ + 2)/3, with the latter improving on a ∆/2 ratio of Hochbaum for ∆ ≥ 5. We also obtain a O(n/ log n) performance ratio for va...
متن کاملApproximation algorithms for optimization problems in graphs with superlogarithmic treewidth
We present a generic scheme for approximating NP-hard problems on graphs of treewidth k = ω(log n). When a tree-decomposition of width ` is given, the scheme typically yields an `/ lg n-approximation factor; otherwise, an extra log k factor is incurred. Our method applies to several basic subgraph and partitioning problems, including the maximum independent set problem.
متن کاملA Partitioning Algorithm for Maximum Common Subgraph Problems
We introduce a new branch and bound algorithm for the maximum common subgraph and maximum common connected subgraph problems which is based around vertex labelling and partitioning. Our method in some ways resembles a traditional constraint programming approach, but uses a novel compact domain store and supporting inference algorithms which dramatically reduce the memory and computation require...
متن کاملThe spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996